A Note on the Rank Bounded Distance and Its Algorithms for Cyclic Codes
نویسندگان
چکیده
منابع مشابه
A Note on the Rank Bounded Distance and Its Algorithms for Cyclic Codes
The minimum distance for linear codes is one of the important parameters. The shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. It is necessary to construct the maximum value of the independent set for the calculation of the shift bound. However, its computational complexity is very large, because the construction of the ind...
متن کاملA new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...
متن کاملA note on repeated-root cyclic codes
In papers by Castagnoli et al. and Van Lint, cyclic codeswith repeated roots are analyzed. Both papers fail to acknowledge apreviouswork by Chen, dating back to 1969, which includes an analysisof even, length binary cyclic codes. Results from Chen’s study arepresented. Index Terms -Binary cyclic codes of even length. In [l] and [2], the so called repeated-root cyclic codes h...
متن کاملOn the roots and minimum rank distance of skew cyclic codes
Skew cyclic codes play the same role as cyclic codes in the theory of errorcorrecting codes for the rank metric. In this paper, we give descriptions of these codes by idempotent generators, root spaces and cyclotomic spaces. We prove that the lattice of skew cyclic codes is anti-isomorphic to the lattice of root spaces and extend the rank-BCH bound on their minimum rank distance to rank-metric ...
متن کاملCyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg (IEEE Trans. Inform. Theory, no. 8, 2014). In this paper we focus on optimal cyclic codes that arise from this construction. We give a characterization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pure and Applied Mathematics Journal
سال: 2015
ISSN: 2326-9790
DOI: 10.11648/j.pamj.s.2015040201.17